A New Affine Invariant for Polytopes and Schneider’s Projection Problem
نویسندگان
چکیده
New affine invariant functionals for convex polytopes are introduced. Some sharp affine isoperimetric inequalities are established for the new functionals. These new inequalities lead to fairly strong volume estimates for projection bodies. Two of the new affine isoperimetric inequalities are extensions of Ball’s reverse isoperimetric inequalities. If K is a convex body (i.e., a compact, convex subset with nonempty interior) in Euclidean n-space, R, then on the unit sphere, Sn−1, its support function, h(K, · ) : Sn−1 → R, is defined for u ∈ Sn−1 by h(K, u) = max{u · y : y ∈ K}, where u ·y denotes the standard inner product of u and y. The projection body, ΠK, of K can be defined as the convex body whose support function, for u ∈ Sn−1, is given by h(ΠK,u) = voln−1(K|u⊥), where voln−1 denotes (n − 1)-dimensional volume and K|u⊥ denotes the image of the orthogonal projection of K onto the codimension 1 subspace orthogonal to u. An important unsolved problem regarding projection bodies is Schneider’s projection problem: What is the least upper bound, as K ranges over the class of origin-symmetric convex bodies in R, of the affine-invariant ratio (∗) [V (ΠK)/V (K)n−1]1/n, 1991 Mathematics Subject Classification. 52A40.
منابع مشابه
A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملOn Computing the Shadows and Slices of Polytopes
We study the projection of polytopes along k orthogonal vectors for various input and output forms. We show that if k is part of the input and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing ...
متن کاملOn the Decidability of Reachability in Linear Time-Invariant Systems
We consider the decidability of state-to-state reachability in linear time-invariant control systems, with control sets defined by boolean combinations of linear inequalities. Decidability of the sub-problem in which control sets are linear subspaces is a fundamental result in control theory. We first show that reachability is undecidable if the set of controls is a finite union of affine subsp...
متن کاملExtraction of Affine Invariant Features Using Fractal
An approach based on fractal is presented for extracting affine invariant features. Central projection transformation is employed to reduce the dimensionality of the original input pattern, and general contour (GC) of the pattern is derived. Affine invariant features cannot be extracted from GC directly due to shearing. To address this problem, a group of curves (which are called shift curves) ...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کامل